Searching via walking: How to find a marked subgraph of a graph using quantum walks

We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how to implement the quantum walk using a quantum circuit and a quantum oracle, which allows us to specify the resource needed for a quantitative comparison of the efficiency of classical and quantum searches -- the number of oracle calls.Comment: 4 pages, 2 figure

Quantum searches on highly symmetric graphs

We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of the vertices have the same scattering properties except for a subset of special vertices. The object of the search is to find a special vertex. A quantum circuit implementation of these walks is presented in which the set of special vertices is specified by a quantum oracle. We consider the complete graph, a complete bipartite graph, and an $M$-partite graph. In all cases, the dimension of the Hilbert space in which the time evolution of the walk takes place is small (between three and six), so the walks can be completely analyzed analytically. Such dimensional reduction is due to the fact that these graphs have large automorphism groups. We find the usual quadratic quantum speedups in all cases considered.Comment: 11 pages, 6 figures; major revision

Non-Markovian decoherence in the adiabatic quantum search algorithm

We consider an adiabatic quantum algorithm (Grover's search routine) weakly coupled to a rather general environment, i.e., without using the Markov approximation. Markovian errors generally require high-energy excitations (of the reservoir) and tend to destroy the scalability of the adiabatic quantum algorithm. We find that, under appropriate conditions (such as low temperatures), the low-energy (i.e., non-Markovian) modes of the bath are most important. Hence the scalability of the adiabatic quantum algorithm depends on the infra-red behavior of the environment: a reasonably small coupling to the three-dimensional electromagnetic field does not destroy the scaling behavior, whereas phonons or localized degrees of freedom can be problematic. PACS: 03.67.Pp, 03.67.Lx, 03.67.-a, 03.65.Yz

Upper bounds on entangling rates of bipartite Hamiltonians

We discuss upper bounds on the rate at which unitary evolution governed by a non-local Hamiltonian can generate entanglement in a bipartite system. Given a bipartite Hamiltonian H coupling two finite dimensional particles A and B, the entangling rate is shown to be upper bounded by c*log(d)*norm(H), where d is the smallest dimension of the interacting particles, norm(H) is the operator norm of H, and c is a constant close to 1. Under certain restrictions on the initial state we prove analogous upper bound for the ancilla-assisted entangling rate with a constant c that does not depend upon dimensions of local ancillas. The restriction is that the initial state has at most two distinct Schmidt coefficients (each coefficient may have arbitrarily large multiplicity). Our proof is based on analysis of a mixing rate -- a functional measuring how fast entropy can be produced if one mixes a time-independent state with a state evolving unitarily.Comment: 14 pages, 4 figure

Universal quantum computation by discontinuous quantum walk

Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This `discontinuous' quantum walk employs perfect quantum state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one timestep apart.Comment: 7 pages, revte

Structural lineaments in the southern Sierra Nevada, California

The author has identified the following significant results. Several lineaments observed in ERTS-1 MSS imagery over the southern Sierra Nevada of California have been studied in the field in an attempt to explain their geologic origins and significance. The lineaments are expressed topographically as alignments of linear valleys, elongate ridges, breaks in slope or combinations of these. Natural outcrop exposures along them are characteristically poor. Two lineaments were found to align with foliated metamorphic roof pendants and screens within granitic country rocks. Along other lineaments, the most consistant correlations were found to be alignments of diabase dikes of Cretaceous age, and younger cataclastic shear zones and minor faults. The location of several Pliocene and Pleistocene volcanic centers at or near lineament intersections suggests that the lineaments may represent zones of crustal weakness which have provided conduits for rising magma

Evidence of a major fault zone along the California-Nevada state line 35 deg 30 min to 36 deg 30 min north latitude

The author has identified the following significant results. Geologic reconnaissance guided by analysis of ERTS-1 and Apollo-9 satellite imagery and intermediate scale photography from X-15 and U-2 aircraft has confirmed the presence of a major fault zone along the California-Nevada state line, between 35 deg 30 min and 36 deg 30 min north latitude. The name Pahrump Fault Zone has been suggested for this feature after the valley in which it is best exposed. Field reconnaissance has indicated the existence of previously unreported faults cutting bedrock along range fronts, and displacing Tertiary and Quaternary basin sediments. Gravity data support the interpretation of regional structural discontinuity along this zone. Individual fault traces within the Pahrump Fault Zone form generally left-stepping en echelon patterns. These fault patterns, the apparent offset of a Laramide age thrust fault, and possible drag folding along a major fault break suggest a component of right lateral displacement. The trend and postulated movement of the Pahrump Fault Zone are similar to the adjacent Las Vegas Shear Zone and Death Valley-Furnace Creek Faults, which are parts of a regional strike slip system in the southern Basin-Range Province

Crustal extension and transform faulting in the southern Basin Range Province

The author has identified the following significant results. Field reconnaissance and study of geologic literature guided by analysis of ERTS-1 MSS imagery have led to a hypothesis of tectonic control of Miocene volcanism, plutonism, and related mineralization in part of the Basin Range Province of southern Nevada and northwestern Arizona. The easterly trending right-lateral Las Vegas Shear Zone separates two volcanic provinces believed to represent areas of major east-west crustal extension. One volcanic province is aligned along the Colorado River south of the eastern termination of the Las Vegas Shear Zone; the second province is located north of the western termination of the shear zone in southern Nye County, Nevada. Geochronologic, geophysical, and structural evidence suggests that the Las Vegas Shear Zone may have formed in response to crustal extension in the two volcanic provinces in a manner similar to the formation of a ridge-ridge transform fault, as recognized in ocean floor tectonics

Numerical Analysis of the Capacities for Two-Qubit Unitary Operations

We present numerical results on the capacities of two-qubit unitary operations for creating entanglement and increasing the Holevo information of an ensemble. In all cases tested, the maximum values calculated for the capacities based on the Holevo information are close to the capacities based on the entanglement. This indicates that the capacities based on the Holevo information, which are very difficult to calculate, may be estimated from the capacities based upon the entanglement, which are relatively straightforward to calculate.Comment: 9 pages, 10 figure

Quantum Communication Through an Unmodulated Spin Chain

We propose a scheme for using an unmodulated and unmeasured spin-chain as a channel for short distance quantum communications. The state to be transmitted is placed on one spin of the chain and received later on a distant spin with some fidelity. We first obtain simple expressions for the fidelity of quantum state transfer and the amount of entanglement sharable between any two sites of an arbitrary Heisenberg ferromagnet using our scheme. We then apply this to the realizable case of an open ended chain with nearest neighbor interactions. The fidelity of quantum state transfer is obtained as an inverse discrete cosine transform and as a Bessel function series. We find that in a reasonable time, a qubit can be directly transmitted with better than classical fidelity across the full length of chains of up to 80 spins. Moreover, the spin-chain channel allows distillable entanglement to be shared over arbitrarily large distances.Comment: Much improved versio